Optimal storage allocation for serial files
نویسندگان
چکیده
منابع مشابه
Optimal Storage Allocation for Serial
A computer system uses several serial files. The files reside on a direct-access storage device in which storage space is limited. Records are added to the files either by jobs in batch processing mode, or by on-line transactions. Each transaction (or job) generates a demand vector which designates the space required in each file for record addition. Whenever one file runs out of space, the sys...
متن کاملOptimal Storage Allocation for Paritionable Processors
Dr. H. Pat Artis Performance Associates, Inc. 72-687 Spyglass Lane Palm Desert, CA 92260 (760) 346-0310 [email protected] Abstract: Processor partitioning mechanisms such as MDF, PR/SM, and MLPF allow a user to partition the resources of a physical processor to create several logical systems that meet the needs of the user’s workloads. While the distribution of the processor’s CPU is primaril...
متن کاملa benchmarking approach to optimal asset allocation for insurers and pension funds
uncertainty in the financial market will be driven by underlying brownian motions, while the assets are assumed to be general stochastic processes adapted to the filtration of the brownian motions. the goal of this study is to calculate the accumulated wealth in order to optimize the expected terminal value using a suitable utility function. this thesis introduced the lim-wong’s benchmark fun...
15 صفحه اولDisk Allocation Methods for Parallelizing Grid Files
The grid file [1] is a well known access method for multi-dimensional and spatial data. The response time needed to process path and range queries on the grid file access method can be improved significantly by distributing the data pages over multiple disks. This paper explores the disk allocation methods used to allocate the data pages of grid file among a set of disks, which can be accessed ...
متن کاملStorage Management for Files of Dynamic Records
We propose a new scheme for managing files of variable-length dynamic records, based on storing the records in large, fixed-length blocks. We demonstrate the effectiveness of this scheme for text indexing, showing that it achieves space utilisation of over 95%. With an appropriate block size and caching strategy, our scheme requires on average around two disk accesses—one read and one write—for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 1979
ISSN: 0001-0782,1557-7317
DOI: 10.1145/359060.359077